The independent set sequence of regular bipartite graphs
نویسندگان
چکیده
منابع مشابه
The independent set sequence of regular bipartite graphs
Let it(G) be the number of independent sets of size t in a graph G. Alavi, Erdős, Malde and Schwenk made the conjecture that if G is a tree then the independent set sequence {it(G)}t≥0 of G is unimodal; Levit and Mandrescu further conjectured that this should hold for all bipartite G. We consider the independent set sequence of finite regular bipartite graphs, and graphs obtained from these by ...
متن کاملThe complexity of independent set reconfiguration on bipartite graphs
We settle the complexity of the Independent Set Reconfiguration problem on bipartite graphs under all three commonly studied reconfiguration models. We show that under the token jumping or token addition/removal model the problem is NP-complete. For the token sliding model, we show that the problem remains PSPACE-complete.
متن کاملq - regular bipartite graphs
An explicit construction of a family of binary LDPC codes called LU(3, q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The proof involves the geometry of a 4-dimensional symplectic vector space and the action of the symplectic group and its subgroups.
متن کاملBohdan Zelinka INDEPENDENT SET DOMINATING SETS IN BIPARTITE GRAPHS
The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset D of the vertex set V (G) of a graph G is called a set dominating set (shortly sd−set) in G, if for each set X ⊆ V (G) −D there exists a set Y ⊆ D such that the subgraph 〈X ∪ Y 〉 of G induced by X ∪ Y is connected. The minimum number of vertices of an sd−set in G is called t...
متن کاملParallel Maximum Independent Set in Convex Bipartite Graphs
A bipartite graph G = (V;W; E) is called convex if the vertices in W can be ordered in such a way that the elements of W adjacent to any vertex v 2 V form an interval (i.e. a sequence consecutively numbered vertices). Such a graph can be represented in a compact form that requires O(n) space, where n = maxfjV j; jW jg. Given a convex bipartite graph G in the compact form Dekel and Sahni designe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.06.011